ASIC Architectures for Implementing ECC Arithmetic over Finite Fields
نویسنده
چکیده
The ever growing need for improved security for applications over internet has resulted in wide acceptance of Elliptic Curve Cryptography (ECC) in industry and academic research. This growth has started the spread of architectures for implementing ECC from FPGA towards ASIC. Computing scalar multiplication and point inversion forms the core ECC architecture. This paper discusses the ASIC based implementation of these ECC arithmetic primitives over finite fields GF(2). Scalar multiplication is based on a recursive variant of Karatsuba Algorithm and Inversion algorithms are based on quad-ITA. The arithmetic components are designed using Verilog and implemented using Cadence 45nm fast technology library. The proposed variation of Karatsuba Multiplier has low power considerations and better area delay product.
منابع مشابه
Architectures for Arithmetic Operations in Gf(2m) Using Polynomial and Normal Basis for Elliptic Curve Cryptosystems
Elliptic Curve Cryptography (ECC) fits well for an efficient and secure encryption scheme. It is efficient than the ubiquitous RSA based schemes because ECC utilizes smaller key sizes for equivalent security. This feature of ECC enables it to be applied to Wireless networks where there are constraints related to memory and computational power. Fast and high-performance computation of finite fie...
متن کاملA Survey on Hardware Implementations of Elliptic Curve Cryptosystems
In the past two decades, Elliptic Curve Cryptography (ECC) have become increasingly advanced. ECC, with much smaller key sizes, offers equivalent security when compared to other asymmetric cryptosystems. In this survey, an comprehensive overview of hardware implementations of ECC is provided. We first discuss different elliptic curves, point multiplication algorithms and underling finite field ...
متن کاملUltra High Performance ECC over NIST Primes on Commercial FPGAs
Elliptic Curve Cryptosystems (ECC) have gained increasing acceptance in practice due to their significantly smaller bit size of the operands compared to other public-key cryptosystems. Since their computational complexity is often lower than in the case of RSA or discrete logarithm schemes, ECC are often chosen for high performance publickey applications. However, despite a wealth of research r...
متن کاملA Bit-Serial Multiplier Architecture for Finite Fields Over Galois Fields
Problem statement: A fundamental building block for digital communication is the Publickey cryptography systems. Public-Key Cryptography (PKC) systems can be used to provide secure communications over insecure channels without exchanging a secret key. Implementing Public-Key cryptography systems is a challenge for most application platforms when several factors have to be considered in selectin...
متن کاملA Bit-Serial Multiplier Architecture for Finite Fields Over Galois Fields
Problem statement: A fundamental building block for digital communication is the Publickey cryptography systems. Public-Key Cryptography (PKC) systems can be used to provide secure communications over insecure channels without exchanging a secret key. Implementing Public-Key cryptography systems is a challenge for most application platforms when several factors have to be considered in selectin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015